On the Complexity of Polyhedral Separability
نویسنده
چکیده
It is NP complete to recognize whether two sets of points in general space can be separated by two hyperplanes It is NP complete to recognize whether two sets of points in the plane can be separated with k lines For every xed k in any xed dimension it takes polynomial time to recognize whether two sets of points can be separated with k hyperplanes
منابع مشابه
Complexity and Approximability of Committee Polyhedral Separability of Sets in General Position
It is known that the minimum affine separating committee (MASC) combinatorial optimization problem, which is related to some machine learning techniques, is NP-hard and does not belong to Apx class unless P = NP . In this paper, it is shown that the MASC problem formulated in a fixed dimension space within n > 1 is intractable even if sets defining an instance of the problem are in general posi...
متن کاملSeparation of Cycle Inequalities for the Periodic Timetabling Problem
Cycle inequalities play an important role in the polyhedral study of the periodic timetabling problem. We give the first pseudo-polynomial time separation algorithm for cycle inequalities, and we give a rigorous proof for the pseudo-polynomial time separability of the change-cycle inequalities. The efficiency of these cutting planes is demonstrated on real-world instances of the periodic timeta...
متن کاملA New Approach to Nonconvex Optimization
In this paper we propose a new approach based on global optimality conditions for solving continuous nonconvex optimization problems. We present in detail a technique for nding a solution to the following three problems: the problem of polyhedral separability, the problem of solving a system of nonlinear equations, and the problem of nding the Nash equilibrium point in bimatrix games by means o...
متن کاملComputing finite-dimensional bipartite quantum separability
Ever since entanglement was identified as a computational and cryptographic resource, effort has been made to find an efficient way to tell whether a given density matrix represents an unentangled, or separable, state. Essentially, this is the quantum separability problem. In Chapter 1, I begin with a brief introduction to quantum states, entanglement, and a basic formal definition of the quant...
متن کاملUsing Separating Planes between Objects for Eecient Hidden Surface Removal
This paper describes a new technique for generation of binary space partition trees representing polyhedral objects and outlines an eecient algorithm for operations such as composition, deletion and motion of objects. We assume a modiied version of BSP trees with all the polygon fragments lying at the leaf nodes described in 9]. The eeciency of merging algorithm for two BSP trees depends on the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete & Computational Geometry
دوره 3 شماره
صفحات -
تاریخ انتشار 1988